Irreducible characters which are zero on only one conjugacy class
نویسندگان
چکیده
منابع مشابه
Irreducible characters which are zero on only one conjugacy class
Suppose that G is a nite solvable group which has an irreducible character which vanishes on exactly one conjugacy class. Then we show that G has a homomorphic image which is a nontrivial 2-transitive permutation group. The latter groups have been classi ed by Huppert. We can also say more about the structure of G depending on whether is primitive or not. Mathematics Subject Classi cation 2000...
متن کاملGroups Whose Nonlinear Irreducible Characters Separate Element Orders or Conjugacy Class Sizes
A class function φ on a finite group G is said to be an order separator if, for every x and y in G\{1} , φ(x) = φ(y) is equivalent to x and y being of the same order. Similarly, φ is said to be a class-size separator if, for every x and y in G \ {1} , φ(x) = φ(y) is equivalent to |CG(x)| = |CG(y)| . In this paper, finite groups whose nonlinear irreducible complex characters are all order separa...
متن کاملOn the irreducible characters of Camina triples
The Camina triple condition is a generalization of the Camina condition in the theory of finite groups. The irreducible characters of Camina triples have been verified in the some special cases. In this paper, we consider a Camina triple (G,M,N) and determine the irreducible characters of G in terms of the irreducible characters of M and G/N.
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملRemarks on Computing Irreducible Characters
0.1. Let G be a connected reductive algebraic group defined over a finite field Fq and let G(Fq) be the finite group of all Fq-rational points of G. We would like to present here a strategy for computing the character table of G(Fq) , under the assumption that p, the characteristic of Fq , is sufficiently large. We can assume that G has a simply connected derived group. Indeed, in the general c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2006
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-06-08628-x